What is the current state of the Multilingual Web of Data?

The Semantic Web is growing at a fast pace, recently boosted by the creation of the Linked Data initiative and principles. Methods, standards, techniques and the state of technology are becoming more mature and therefore are easing the task of publication and consumption of semantic information on the Web

Quo vadis accounting and auditing in Turkey

The main purpose of the research was to illustrate the history of accounting and auditing in Turkey. It is found that auditing has evolved through a number of stages. Current status of accounting and auditing profession in Turkey has been examined in this study. Recent issues and applications with regard to the statutory audits in Turkey has examined in detail. Related problems and solutions will also be discussed from a broad perspective of the professional standards

Stabilized Benders methods for large-scale combinatorial optimization, with appllication to data privacy

The Cell Suppression Problem (CSP) is a challenging Mixed-Integer Linear Problem arising in statistical tabular data protection. Medium sized instances of CSP involve thousands of binary variables and million of continuous variables and constraints. However, CSP has the typical structure that allows application of the renowned Benders’ decomposition method: once the “complicating” binary variables are fixed, the problem decomposes into a large set of linear subproblems on the “easy” continuous ones. This allows to project away the easy variables, reducing to a master problem in the complicating ones where the value functions of the subproblems are approximated with the standard cutting-plane approach. Hence, Benders’ decomposition suffers from the same drawbacks of the cutting-plane method, i.e., oscillation and slow convergence, compounded with the fact that the master problem is combinatorial. To overcome this drawback we present a stabilized Benders decomposition whose master is restricted to a neighborhood of successful candidates by local branching constraints, which are dynamically adjusted, and even dropped, during the iterations. Our experiments with randomly generated and real-world CSP instances with up to 3600 binary variables, 90M continuous variables and 15M inequality constraints show that our approach is competitive with both the current state-of-the-art (cutting-plane-based) code for cell suppression, and the Benders implementation in CPLEX 12.7. In some instances, stabilized Benders is able to quickly provide a very good solution in less than one minute, while the other approaches were not able to find any feasible solution in one hour.Peer ReviewedPreprin

Motivic Milnor fiber of a quasi-ordinary hypersurface

Let f : (Cd+1, 0) -> (C, 0) be a germ of complex analytic function such that its zero level defines an irreducible germ of quasi-ordinary hypersurface (S, 0) subset of (Cd+1, 0). We describe the motivic Igusa zeta function, the motivic Milnor fibre and the Hodge-Steenbrink spectrum of f at 0 in terms of topological invariants of (S, 0) subset of (Cd+1, 0)